On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
نویسندگان
چکیده
منابع مشابه
Geometric approaches to computing Kostka numbers and Littlewood-Richardson coefficients
Using tools from combinatorics, convex geometry and symplectic geometry, we study the behavior of the Kostka numbers Kλβ and Littlewood-Richardson coefficients cλμ (the type A weight multiplicities and Clebsch-Gordan coefficients). We show that both are given by piecewise polynomial functions in the entries of the partitions and compositions parametrizing them, and that the domains of polynomia...
متن کاملOn the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
Kostka numbers and Littlewood-Richardson coefficients appear in combinatorics and representation theory. Interest in their computation stems from the fact that they are present in quantum mechanical computations since Wigner [15]. In recent times, there have been a number of algorithms proposed to perform this task [1–3, 11, 12]. The issue of their computational complexity has received attentio...
متن کاملJa n 20 05 The computation of Kostka numbers and Littlewood - Richardson coefficients is # P - complete
Kostka numbers and Littlewood-Richardson coefficients play an essential role in the representation theory of the symmetric groups and the special linear groups. There has been a significant amount of interest in their computation ([1], [10], [11], [2], [3]). The issue of their computational complexity has been a question of folklore, but was asked explicitly by E. Rassart [10]. We prove that th...
متن کاملGeometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients
We point out that the remarkable Knutson and Tao Saturation Theorem [9] and polynomial time algorithms for linear programming [14] have together an important, immediate consequence in geometric complexity theory [15, 16]: The problem of deciding positivity of Littlewood-Richardson coefficients belongs to P ; cf.[10]. Specifically, for GLn(C), positivity of a Littlewood-Richardson coefficient cα...
متن کاملSmall Littlewood-Richardson coefficients
We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient cνλ,μ for given partitions λ, μ and ν. This graph was first introduced in [BI12], where its connectedness was proved. Our insights are useful for the design of algorithms for computing the Littlewood-Richardson coefficient: We design an algorithm for the exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2006
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-006-0008-5